Operads of Finite Posets
نویسندگان
چکیده
منابع مشابه
Operads of Finite Posets
We describe four natural operad structures on the linear species of finite posets. The three last ones are set-theoretical and can be seen as a simplified version of the first, the same way the NAP operad behaves with respect to the pre-Lie operad. Moreover the two first ones are isomorphic.
متن کاملOperads from posets and Koszul duality
We introduce a functor As from the category of posets to the category of nonsymmetric binary and quadratic operads, establishing a new connection between these two categories. Each operad obtained by the construction As provides a generalization of the associative operad because all of its generating operations are associative. This construction has a very singular property: the operads obtaine...
متن کاملKoszul duality of operads and homology of partition posets
We consider partitions of a set with r elements ordered by refinement. We consider the simplicial complex K̄(r) formed by chains of partitions which starts at the smallest element and ends at the largest element of the partition poset. A classical theorem asserts that K̄(r) is equivalent to a wedge of r− 1-dimensional spheres. In addition, the poset of partitions is equipped with a natural action...
متن کاملPosets of Finite Functions
The symmetric group S(n) is partially ordered by Bruhat order. This order is extended by L. Renner to the set of partial injective functions of {1, 2, . . . , n} (see, Linear Algebraic Monoids, Springer, 2005). This poset is investigated by M. Fortin in his paper The MacNeille Completion of the Poset of Partial Injective Functions [Electron. J. Combin., 15, R62, 2008]. In this paper we show tha...
متن کاملPresenting Finite Posets
String rewriting systems have been originally introduced by Thue [21] in order to study word problems in monoids. A string rewriting system (Σ,R) consists of a set Σ, called the alphabet, and a set R ⊆ Σ∗×Σ∗ of rules. The monoid Σ∗/≡R, obtained by quotienting the free monoid Σ∗ over Σ by the smallest congruence (wrt concatenation) containing R, is called the monoid presented by the rewriting sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/6498